Quasi-simple relations in copies of a given recursive structure

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possible Degrees in Recursive Copies

Let A be a recursive structure, and let R be a recursive relation on A. Harizanov ( 1991) isolated a syntactical condition which (with additional effectiveness conditions) is necessary and sufficient for A to have recursive copies in which the image of R is r.e. of arbitrary te. degree. We had conjectured that a certain extension of Harizanov’s syntactical condition would (with some effectivene...

متن کامل

the role of thematic structure in comprehending spoken language

in fact this study is concerned with the relationship between the variation in thematice structure and the comprehension of spoken language. so the study focused on the following questions: 1. is there any relationship between thematic structure and the comprehension of spoken language? 2. which of the themes would have greated thematic force and be easier for the subjects to comprehend? accord...

15 صفحه اول

Graphs with Many Copies of a Given Subgraph

Let c > 0, and H be a fixed graph of order r. Every graph on n vertices containing at least cnr copies of H contains a “blow-up” of H with r − 1 vertex classes of size ⌊ c r lnn ⌋ and one vertex class of size greater than n1−c r−1 . A similar result holds for induced copies of H. Main results Suppose that a graph G of order n contains cn copies of a given subgraph H on r vertices. How large “bl...

متن کامل

Graph Structure and Recursive Estimation of Noisy Linear Relations

This paper examines estimation problems speci ed by noisy linear relations describing either dynamical models or measurements. Each such problem has a graph structure, which can be exploited to derive recursive estimation algorithms only when the graph is acyclic, i.e., when it is obtained by combining disjoint trees. Aggregation techniques appropriate for reducing an arbitrary graph to an acyc...

متن کامل

Deriving Spatiotemporal Relations from Simple Data Structure

A spatiotemporal data model is incomplete without three components: classes, consistency constraints, and operators. Classes define the structure of the model, constraints enforce consistency in the model, and operators operate on the structure of the model. In the past, many models have been proposed, but most of them discussed the classes. The studies on operators for spatiotemporal data mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1997

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(97)00010-9